#include <iostream>
#include <cstring>
#include <algorithm>
#include <cstdio>
#include <cmath>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <set>
#include <bitset>
#include <utility>
using namespace std;

#define mm(a, n) memset(a, n, sizeof a)
#define mk(a, b) make_pair(a, b)

const double eps = 1e-6;
const int INF = 0x3f3f3f3f;

typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int, int> PII;
typedef pair<double, double> PDD;
typedef pair<LL, LL> PLL;
typedef pair<int, LL> PIL;

inline void quickread() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
}

int eval(int a) {
    a ++ ;
    int ret = 0;
    for (int i = 1; i <= a; i <<= 1) {
        int cnt = a / i;
        int cnt_i = cnt / 2 * i;
        if (cnt % 2) cnt_i += a - a / i * i;
        if (cnt_i & 1) ret |= i;
    }
    return ret;
}

inline void solution() {
    int a, b;
    cin >> a >> b;
    int XOR = eval(a - 1);
    if (XOR == b) cout << a << endl;
    else if((XOR ^ b) != a) cout << a + 1 << endl;
    else cout << a + 2 << endl;
}

int main() {
    // freopen("input.txt", "r", stdin);
    quickread();
    int T;
    cin >> T;
    while (T -- ) {
       solution();
    }
    return 0;
}